On the modification of bit-flipping decoder of LDPC-codes

Introduction. In all types of digital communication, error control coding techniques are used. Many communication standards, such as Wi-Fi and 5G, use low density parity check (LDPC) codes. These codes popular because they provide building encoders decoders with computational complexity. This work objective is to increase the correcting capability well-known bit-flipping decoder (BF) LDPC-codes. For this purpose, a modification built, which enables dynamically one its main parameters whose choice affects significantly quality decoding. Materials Methods. The binary LDPC-codes considered. has several that not rigidly bound code parameters. dependence decoding on selection output was investigated through simulation modeling. It shown results in case affected by input parameter — threshold T. A BF-decoder been developed, it proposed set during execution algorithm depending rate. comparative analysis error- carried out modeling method. Results. lemma maximum value T formulated proved. Upper bounds for number operations found original modified decoders. model implements noise-immune channel built. model, initial data encoded given LDPC-code, then made noisy additive uniformly distributed errors, thereafter, decoded turn different parameters, well decoder. Based data, correction capacity used estimated. Experiments have error-correcting range real rate higher than decoder, regardless Discussion Conclusions. lemma, proved paper, sets upper simplifies adjustment. developed better compared Nevertheless, complexity slightly increased algorithm. pointed develops decrease cycles Tanner graph an length code.